翻訳と辞書 |
Guruswami–Sudan list decoding algorithm : ウィキペディア英語版 | Guruswami–Sudan list decoding algorithm
In coding theory, list decoding is an alternative to unique decoding of error-correcting codes for large error rates. Using unique decoder one can correct up to fraction of errors. But when error rate is greater than , unique decoder will not able to output the correct result. List decoding overcomes that issue. List decoding can correct more than fraction of errors. There are many efficient algorithms that can perform List decoding. list decoding algorithm for Reed–Solomon (RS) codes by Sudan which can correct up to errors is given first. Later on more efficient Guruswami–Sudan list decoding algorithm, which can correct up to errors is discussed. Here is the plot between rate R and distance for different algorithms. https://wiki.cse.buffalo.edu/cse545/sites/wiki.cse.buffalo.edu.cse545/files/81/Graph.jpg == Algorithm 1 (Sudan's list decoding algorithm) ==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Guruswami–Sudan list decoding algorithm」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|